Index sort algorithm for positive integers
نویسندگان
چکیده
منابع مشابه
An algorithm for factoring integers
We propose an algorithm for factoring a composite number. The method seems new.
متن کاملCovering the Positive Integers
For real numbers CL> 0 and /I, let S(or, fl) denote the set of integers {[WI + /I] : n = I, 2, 3,...} where, as usual, [x] denotes the greatest integer <.x. A finite family {S(q) pi) : 1 < i < r> of these sets is said to be an eventual covering fami& (ECF) if every sufficiently large integer occurs in exactly one S(CX~, pi). It is well known (e.g., see [I 11, [l], [6], [7]) that if all /3, are ...
متن کاملQuick Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. In this paper, we introduce Quick Sort, a divide-and-conquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity in best case and O(N) in worst case theoretically. We also introduce a way to approach the best case.
متن کاملModified Merge Sort Algorithm
Given a sequence of N elements a1, a2, a3, ..., aN. The desired output will be a’1, a’2, a’3,..., a’N such that a’1≤, a’2≤, a’3≤...≤a’N using merge sort. In this paper, we propose a modification to the existing merge sort algorithm to sort the given elements when the input sequence (or a part of it) is in ascending or descending order in a more efficient way by reducing the number of comparison...
متن کاملMerge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion and Selection Sort all have a quadratic time complexity that limits their use when the number of elements is very big. In this paper, we introduce Merge Sort, a divide-andconquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity of merge sor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science World Journal
سال: 2010
ISSN: 1597-6343
DOI: 10.4314/swj.v3i3.51816